منابع مشابه
A Lower Bound for Area-Universal Graphs
Devdatt Dubhashi§ We establish a lower bound on the efficiency of area-universal circuits. The area Au of every graph H that can host any graph G of area (at most) A with dilation d, and congestion c ~ ../AI log log A satisfies the tradeoff Au = O(AlogAI(c log(2d»), . In particular, ifAu = 0 (A) then max( c, d) = O( Jlog AI log log A).
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA Universal Lower Bound for the Kernel Estimate
Let f,, be the kernel density estimate with arbitrary smoothing factor h and arbitrary (absolutely integrable) kernel K, based upon an i.i.d. sample of size n drawn from a density f. It is shown that
متن کاملA lower bound for 4-regular planar unit distance graphs
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1994
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00070-0